A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only Knowing

نویسنده

  • Joseph Y. Halpern
چکیده

Fifteen years of work on nonmonotonic logic has certainly increased our understanding of the area. However, given a problem in which nonmonotonic reasoning is called for, it is far from clear how one should go about modeling the problem using the various approaches. We explore this issue in the context on two of the best-known approaches, Reiter's default logic 1980] and Moore's autoepistemic logic 1985], as well as two related notions of \only knowing", due to Halpern and Moses 1984] and Levesque 1990]. In particular, we return to the original technical deenitions given in these papers, and examine the extent to which they capture the intuitions they were designed to capture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Only-Knowing: Taking It Beyond Autoepistemic Reasoning

The idea of only-knowing a collection of sentences has been previously shown to have a close connection with autoepistemic logic. Here we propose a more general account of only-knowing that captures not only autoepistemic logic but default logic as well. This allows us not only to study the properties of default logic in terms of an underlying model of belief, but also the relationship among di...

متن کامل

Only-Knowing Meets Nonmonotonic Modal Logic

Only-knowing was originally introduced by Levesque to capture the beliefs of an agent in the sense that its knowledge base is all the agent knows. When a knowledge base contains defaults Levesque also showed an exact correspondence between only-knowing and autoepistemic logic. Later these results were extended by Lakemeyer and Levesque to also capture a variant of autoepistemic logic proposed b...

متن کامل

Complexity of Only Knowing: The Propositional Case

We study the computational properties of the propositional fragment of Levesque's logic of only knowing. In particular, we show that the problem of reasoning with only knowing in the propositional case lies at the second level of the polynomial hierarchy. Thus, it is as hard as reasoning in the majority of propositional formalisms for nonmonotonic reasoning, like default logic, circumscription ...

متن کامل

On the decidability and complexity of reasoning about only knowing

We study reasoning in Levesque’s logic of only knowing. In particular, we first prove that extending a decidable subset of first-order logic with the ability of reasoning about only knowing preserves decidability of reasoning, as long as quantifying-in is not allowed in the language, and define a general method for reasoning about only knowing in such a case. Then, we show that the problem of r...

متن کامل

Computing Default Extensions by Reductions on OR

Based on a set of simple logical equivalences we define a rewriting procedure that computes extensions in the propositional fragment of the logic of O introduced by Lakemeyer and Levesque. This logic is capable of representing default logic with the advantage of itself being monotonic, with a clearly defined semantics and a separation of the object level and the meta level. The procedure prepar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993